Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers
نویسندگان
چکیده
منابع مشابه
Maximizing the Throughput of Tandem Lines with Flexible Failure-Prone Servers and Finite Buffers
Consider a tandem queueing network with an infinite supply of jobs in front of the first station, infinite room for completed jobs after the last station, finite buffers between stations, and a number of flexible servers who are subject to failures. We study the dynamic assignment of servers to stations with the goal of maximizing the long-run average throughput. Our main conclusion is that the...
متن کاملFlexible Servers in Tandem Lines with Setups
We study the dynamic assignment of flexible servers to stations in the presence of setup costs that are incurred when servers move between stations. We focus on tandem lines with two stations and two servers with the goal of maximizing the long-run average profit. We investigate how the optimal server assignment policy for such systems depends on the magnitude of the setup costs, as well as on ...
متن کاملFlexible Servers in Understaffed Tandem Lines
We study the dynamic assignment of cross-trained servers to stations in understaffed lines with finite buffers. Our objective is to maximize the production rate. We identify optimal server assignment policies for systems with three stations, two servers, different flexibility structures, and either deterministic service times and arbitrary buffers or exponential service times and small buffers....
متن کاملThroughput Maximization for Tandem Lines with Two Stations and Flexible Servers
For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations in order to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between statio...
متن کاملServer allocation for zero buffer tandem queues
In this paper we consider the problem of allocating servers to maximize throughput for tandem queues with no buffers. We propose an allocation method that assigns servers to stations based on the mean service times and the current number of servers assigned to each station. A number of simulations are run on different configurations to refine and verify the algorithm. The algorithm is proposed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2014
ISSN: 0740-817X,1545-8830
DOI: 10.1080/0740817x.2014.905735